Approximate Analytical Performance Evaluation of a UNIX Based Multiprocessor Operating System
نویسندگان
چکیده
In this paper we consider a non-product form queueing model of a multiprocessor operating system. In order to improve upon model solution time over a discrete-event simulation and a Markov chain based approach, we propose an extension to the shadow technique to allow for any mixture of preemptive and non preemptive priority scheduling strategy combined with class switching. This new technique can be applied to open, closed and mixed queueing networks. Our model results are validated against real measurements.
منابع مشابه
Performance Evaluation of Operating Systems Using Approximate Analytical Methods
The motivation for the following paper were three models for a variant of a UNIX based multiprocessor operating system that was developed at the Institute for mathematical machines and dataprocessing IV [Jung 91]. These models were formerly analyzed by Markovian methods to get performance measures and the measurements of the real system were also available. This models had the following problem...
متن کاملA generalized analysis technique for queuing networks with mixed priority strategy and class switching
A very well known and popular technique for the performance evaluation of current computer and operating systems is analytical modeling based on queueing networks because it is easy to understand and use compared to other modeling techniques. For so called product form queueing networks eecient exact and approximate analysis algorithms exist but most queueing networks of realistic systems do no...
متن کاملA Generalized Analysis Technique for Queueing Networks with Mixed Priority Strategy and Class Switching
A very well known and popular technique for the performance evaluation of current computer and operating systems is analytical modeling based on queueing networks because it is easy to understand and use compared to other modeling techniques. For so called product form queueing networks e cient exact and approximate analysis algorithms exist but most queueing networks of realistic systems do no...
متن کاملA Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملArchitecture and Realization of the Modular Expandable Multiprocessor System MEMSY
Abstract The experimental multiprocessor system MEMSY2 will be described. This system was built to validate the concept of a scalable multiprocessor architecture based on local shared-memory. Main application areas are scientific computations with high demand for processing power and memory capacity. In designing the hardware architecture the extensive use of standard components and fault toler...
متن کامل